Fast distance computation for on-line collision detection with multi-arm robots
نویسندگان
چکیده
For the on-line collision detection with a multi-arm robot a fast method for computing the so-called collision vector is presented. Manipulators and obstacles are modelled by sets of convex polytopes. Known distance algorithms serve as a foundation. To speed up the collision detection dynamic obstacles are approximated by geometric primitives and organized in hierarchies. On-line, the here introduced Dynamic Hierarchies are adjusted to the current arm configuration. A comparison with previous methods shows an increased acceleration of the computations.
منابع مشابه
Fast Proximity Queries with Swept Sphere Volumes
We present novel algorithms for fast proximity queries using swept sphere volumes. The set of proximity queries includes collision detection and both exact and approximate separation distance computation. We introduce a new family of bounding volumes that correspond to a core primitive shape grown outward by some o set. The set of core primitive shapes includes a point, line, and rectangle. Thi...
متن کاملFast swept-volume distance for robust collision detection
The need for collision detection arises in several robotics areas, including motion-planning, online collision avoidance, and simulation. At the heart of most current methods are algorithms for interference detection andor distance computation. A few recent algorithms and implementations are very fast, but to use them for accurate collision detection, very small step sizes can be necessary, red...
متن کاملA simple controller for line following of sailboats
This paper proposes a simple controller for sailboat robots. The resulting controller is simple to implement and its parameters are easy to tune. Its complexity is low enough to be applicable for sailing robots with very limited computation power. The presentation contains all the necessary details to allow a fast and reliable implemention of a sailbot robot controller which follows a line. The...
متن کاملCollision-Free Path Planning in Robot Cells Using Virtual 3D Collision Sensors
In industrial robotic systems, it is crucial to avoid collision among the manipulators or with other objects in the workspace. The problem is more complicated for manipulators than for mobile robots, since not only the effector end must move without collision to the desired location, but the links of the arm must also avoid collisions. The problem has been addressed in various ways in literatur...
متن کاملProximity Queries with Swept Sphere Volumes
We present novel algorithms for fast proximity queries using swept sphere volumes. The set of proximity queries includes collision detection and both exact and approximate separation distance computation. We introduce a new family of bounding volumes that correspond to a core primitive shape grown outward by some ooset. The set of core primitive shapes includes a point, line, and rectangle. Thi...
متن کامل